Symmetry-based decomposition for meshing quasi-axisymmetric components
نویسندگان
چکیده
منابع مشابه
Symmetry-based decomposition for meshing quasi-axisymmetric components
Quasi-axisymmetric structural components are very common in any mechanical equipment containing rotating components, such as turbo machinery. Identifying and exploiting symmetric properties in these components is key to simplify the creation of FE volume meshes. In this paper, a novel approach is proposed to detect exact cyclic symmetries, in order to decompose a quasiaxisymmetric CAD component...
متن کاملRidit Score Type Quasi-Symmetry and Decomposition of Symmetry for Square Contingency Tables with Ordered Categories
Abstract: For square contingency tables with the same row and column ordinal classifications, this paper proposes the quasi-symmetry model based on the marginal ridits. The model indicates that the log-odds that an observation will fall in the (i, j) cell instead of in the (j, i) cell, i < j, is proportional to the difference between the average ridit score of row and column marginal distributi...
متن کاملNew Classes of Quasi-Axisymmetric Stellarator Configurations
We have identified and developed new classes of quasi-axially symmetric configurations which have attractive properties from the standpoint of both near-term physics experiments and long-term power producing reactors. These new configurations were developed as a result of surveying the aspect ratio-rotational transform space to identify regions endowed with particularly interesting features. Th...
متن کاملA Domain Decomposition for a Parallel Adaptive Meshing Algorithm
We describe a domain decomposition algorithm for use in the parallel adaptive meshing paradigm of Bank and Holst. Our algorithm has low communication , makes extensive use of existing sequential solvers, and exploits in several important ways data generated as part of the adaptive meshing paradigm. Numerical examples illustrate the effectiveness of the procedure. In [4, 5], we introduced a gene...
متن کاملA Domain Decomposition Solver for a Parallel Adaptive Meshing Paradigm
We describe a domain decomposition (DD) algorithm for use in the parallel adaptive meshing paradigm of Bank and Holst [3, 4]. Our algorithm has low communication, makes extensive use of existing sequential solvers, and exploits in several important ways data generated as part of the adaptive meshing paradigm. Numerical examples illustrate the effectiveness of the procedure.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Engineering
سال: 2017
ISSN: 1877-7058
DOI: 10.1016/j.proeng.2017.09.812